全文获取类型
收费全文 | 2796篇 |
免费 | 339篇 |
国内免费 | 271篇 |
专业分类
化学 | 249篇 |
晶体学 | 18篇 |
力学 | 232篇 |
综合类 | 83篇 |
数学 | 1976篇 |
物理学 | 848篇 |
出版年
2024年 | 2篇 |
2023年 | 31篇 |
2022年 | 63篇 |
2021年 | 64篇 |
2020年 | 65篇 |
2019年 | 79篇 |
2018年 | 85篇 |
2017年 | 125篇 |
2016年 | 114篇 |
2015年 | 91篇 |
2014年 | 164篇 |
2013年 | 265篇 |
2012年 | 118篇 |
2011年 | 137篇 |
2010年 | 137篇 |
2009年 | 176篇 |
2008年 | 211篇 |
2007年 | 195篇 |
2006年 | 168篇 |
2005年 | 157篇 |
2004年 | 124篇 |
2003年 | 125篇 |
2002年 | 114篇 |
2001年 | 90篇 |
2000年 | 84篇 |
1999年 | 60篇 |
1998年 | 72篇 |
1997年 | 53篇 |
1996年 | 40篇 |
1995年 | 34篇 |
1994年 | 27篇 |
1993年 | 22篇 |
1992年 | 13篇 |
1991年 | 18篇 |
1990年 | 10篇 |
1989年 | 10篇 |
1988年 | 10篇 |
1987年 | 9篇 |
1986年 | 5篇 |
1985年 | 7篇 |
1984年 | 12篇 |
1983年 | 2篇 |
1982年 | 6篇 |
1981年 | 6篇 |
1980年 | 3篇 |
1979年 | 1篇 |
1978年 | 1篇 |
1976年 | 1篇 |
排序方式: 共有3406条查询结果,搜索用时 15 毫秒
1.
本文演示了紧凑的绿色和近红外双色连续波激光光源,其发射波长分别为516 nm和775 nm。设计并制造了级联的周期性极化掺镁铌酸锂晶体,用于同时转换通信波长的二次谐波(SHG)和三次谐波(THG),可以在相同温度下获得绿色和近红外激光的输出。通过建立一个单程激光测量系统,在2 W泵浦功率下获得516 nm的0.15 mW绿光和775 nm的1.19 mW的光,晶体温度控制在30.8 ℃。实验结果将为单激光器泵浦的紧凑型双波长共线激光器提供重要的案例。 相似文献
2.
颜色视觉匹配中明度阈值的评价 总被引:10,自引:8,他引:2
为了对颜色视觉匹配中的明度阈值特性进行评价,采用在阴极射线管显示器上获得的颜色刺激,在5个不同明度的中性色背景下,标准刺激的明度L*从5到95以5个CIELAB单位为变化步长,共对19个不同明度的中性标准颜色进行视觉匹配实验。通过对实验结果的处理和分析,验证了关于颜色刺激视觉辨别明度阈值与背景明度之间相关性的韦伯法则和crispening效应,同时利用颜色视觉匹配数据对基于CIELAB的相关色差公式进行了评价和比较,CIEDE2000具有最好的明度差预测性能,CMC次之,CIELAB和CIE94最差。 相似文献
3.
P.A. Grillet 《Acta Mathematica Hungarica》2005,106(4):301-315
Summary Three weak variants of compactness which lie strictly between compactness and quasicompactness, are introduced. Their basic properties are studied. The interplay with mapping and their direct and inverse preservation under mappings are investigated. In the process three decompositions of compactness are observed. 相似文献
4.
Tor Schoenmeyr David Yu Zhang 《Journal of Algorithms in Cognition, Informatics and Logic》2005,57(2):130-139
The string matching with mismatches problem requires finding the Hamming distance between a pattern P of length m and every length m substring of text T with length n. Fischer and Paterson's FFT-based algorithm solves the problem without error in O(σnlogm), where σ is the size of the alphabet Σ [SIAM–AMS Proc. 7 (1973) 113–125]. However, this in the worst case reduces to O(nmlogm). Atallah, Chyzak and Dumas used the idea of randomly mapping the letters of the alphabet to complex roots of unity to estimate the score vector in time O(nlogm) [Algorithmica 29 (2001) 468–486]. We show that the algorithm's score variance can be substantially lowered by using a bijective mapping, and specifically to zero in the case of binary and ternary alphabets. This result is extended via alphabet remappings to deterministically solve the string matching with mismatches problem with a constant factor of 2 improvement over Fischer–Paterson's method. 相似文献
5.
Heikki Hyyr 《Journal of Discrete Algorithms》2005,3(2-4):215-229
Using bit-parallelism has resulted in fast and practical algorithms for approximate string matching under Levenshtein edit distance, which permits a single edit operation to insert, delete or substitute a character. Depending on the parameters of the search, currently the fastest non-filtering algorithms in practice are the O(km/wn) algorithm of Wu and Manber, the O((k+2)(m−k)/wn) algorithm of Baeza-Yates and Navarro, and the O(m/wn) algorithm of Myers, where m is the pattern length, n is the text length, k is the error threshold and w is the computer word size. In this paper we discuss a uniform way of modifying each of these algorithms to permit also a fourth type of edit operation: transposing two adjacent characters in the pattern. This type of edit distance is also known as Damerau edit distance. In the end we also present an experimental comparison of the resulting algorithms. 相似文献
6.
令H是有限维Hopf代数,A是左H-模代数。本文证明了A是Gorenstein代数的充分必要条件。A^H也是Gorenstein代数的条件。它是Enochs EE,GarciaJJ和del RioA关于群作用相应的理论的推广,同时给出A/A^H是Frobenius扩张的条件。 相似文献
7.
本文通过研究匹配问题的实例空间,匈牙利算法和解空间三者之间的关系,指出S实例空间的数目与问题复杂度之间的关系既不是充分也不是必要的,而如何对问题的解空间进行合理的分解才能是问题的关键。 相似文献
8.
For a graph G and a positive integer m, G(m) is the graph obtained from G by replacing every vertex by an independent set of size m and every edge by m2 edges joining all possible new pairs of ends. If G triangulates a surface, then it is easy to see from Euler's formula that G(m) can, in principle, triangulate a surface. For m prime and at least 7, it has previously been shown that in fact G(m) does triangulate a surface, and in fact does so as a “covering with folds” of the original triangulation. For m = 5, this would be a consequence of Tutte's 5‐Flow Conjecture. In this work, we investigate the case m = 2 and describe simple classes of triangulations G for which G(2) does have a triangulation that covers G “with folds,” as well as providing a simple infinite class of triangulations G of the sphere for which G(2) does not triangulate any surface. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 79–92, 2003 相似文献
9.
Rie Natsui 《Acta Mathematica Hungarica》2005,108(4):299-318
Summary Let Fq be a finite field with q elements. We consider formal Laurent series of Fq -coefficients with their continued fraction expansions by Fq -polynomials. We prove some arithmetic properties for almost every formal Laurent series with respect to the Haar measure. We construct a group extension of the non-archimedean continued fraction transformation and show its ergodicity. Then we get some results as an application of the individual ergodic theorem. We also discuss the convergence rate for limit behaviors. 相似文献
10.
本文是[1,12]的继续,研究描述架中概念的结构;本文讨论后半部分,内容涉及概念内涵与外延的转换,清晰关系的内投影与内变换,概念的结构*以及有关问题的注记。 相似文献